Implementing a CTL Model checker

This paper discusses the implementation of a branching time temporal logic CTL model checker for the PROD Pr/T-Net Reachability analysis tool. A new algorithm for model checking CTL is presented. This algorithm doesn't need the converse of the transition relation as the EMC algorithm does 4]. The algorithm also provides a counterexample and witness facility using one-pass reachabil-ity graph traversal. The ALMC local model checking algorithm as presented in 10] uses a two-pass algorithm. The new algorithm presented here is a global model checking algorithm and requires less memory in the worst case than the local model checking ALMC algorithm.